/*
 * Copyright (c) 2010, 2011
 *	Open Source Technologies Ltd.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Neither the name of the company nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COMPANY AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */
#include <string.h>
#include <stdint.h>
#include <assert.h>

#include "defs.h"
#include "comparator.h"
#include "rbtree.h"
#include "name.h"

const char *
name_lookup(const name_t *list, int id)
{
	assert(list != NULL);

	while (list->n_name) {
		if (list->n_id == id)
			return list->n_name;

		list++;
	}

	return (char *)NULL;
}

rbtree_t *
name_map_create(const name_t *list)
{
	rbtree_t *map;

	map = rbtree_create(comparator_int);
	if (!map)
		return NULL;

	while (list->n_name) {
		if (!rbtree_insert(map, (intptr_t)list->n_id, (intptr_t)list->n_name))
			break;

		list++;
	}

	if (list->n_name) {
		rbtree_destroy(map);
		return NULL;
	}

	return map;
}

int
name_lookup_rev(const name_t *list, const char *name)
{
	assert(list != NULL);
	assert(name != NULL);

	while (list->n_name) {
		if (strcmp(list->n_name, name) == 0)
			return list->n_id;

		list++;
	}

	return -1;
}

rbtree_t *
name_map_create_rev(const name_t *list)
{
	rbtree_t *map;

	map = rbtree_create(comparator_cstr);
	if (!map)
		return NULL;

	while (list->n_name) {
		if (!rbtree_insert(map, (intptr_t)list->n_name, (intptr_t)list->n_id))
			break;

		list++;
	}

	if (list->n_name) {
		rbtree_destroy(map);
		return NULL;
	}

	return map;
}
